On Cayley representations of central Cayley graphs over almost simple groups

A Cayley graph over a group G is said to be central if its connection set normal subset of G. We prove that every simple has at most two pairwise nonequivalent representations associated with the subgroups $${{\,\mathrm{Sym}\,}}(G)$$ induced by left and right multiplications also provide an algorithm which, given $$\Gamma $$ almost whose socle bounded index, finds full in time polynomial size